Termination proof of /tmp/tmp5aUoZZ/PEANO_nosorts

Termination of the following Term Rewriting System could be disproven:

Generalized rewrite system (where rules with free variables on rhs are allowed):
The TRS R consists of the following rules:

and(tt) → X
plus(N, 0) → N
plus(N, s(M)) → s(plus(N, M))

↳ GTRS

  ↳ CritRuleProof

Generalized rewrite system (where rules with free variables on rhs are allowed):
The TRS R consists of the following rules:

and(tt) → X
plus(N, 0) → N
plus(N, s(M)) → s(plus(N, M))

The rule and(tt) → X contains free variables in its right-hand side. Hence the TRS is not-terminating.